MAXIMAL NON-SYMMETRIC ENTROPY LEADS NATURALLY TO ZIPF'S LAW

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measures of maximal entropy

We extend the results of Walters on the uniqueness of invariant measures with maximal entropy on compact groups to an arbitrary locally compact group. We show that the maximal entropy is attained at the left Haar measure and the measure of maximal entropy is unique.

متن کامل

non-corrective approach to pronunciation

the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...

15 صفحه اول

Entropy and Asymptotic Geometry of Non–Symmetric Convex Bodies

We extend to the general, not necessary centrally symmetric setting a number of basic results of Local Theory which were known before for centrally symmetric bodies and were using very essentially the symmetry in their proofs. Some of these extensions look surprising. The main additional tool is a study of volume behavior around the centroid of the body.

متن کامل

Large deviations for Wigner's law and Voiculescu's non-commutative entropy

We study the spectral measure of Gaussian Wigner's matrices and prove that it satis®es a large deviation principle. We show that the good rate function which governs this principle achieves its minimum value at Wigner's semicircular law, which entails the convergence of the spectral measure to the semicircular law. As a conclusion, we give some further examples of random matrices with spectral ...

متن کامل

Symmetric Graphs with Respect to Graph Entropy

Let FG(P ) be a functional defined on the set of all the probability distributions on the vertex set of a graph G. We say that G is symmetric with respect to FG(P ) if the uniform distribution on V (G) maximizes FG(P ). Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic numb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fractals

سال: 2008

ISSN: 0218-348X,1793-6543

DOI: 10.1142/s0218348x08003788